| Bounded choice-free Petri net synthesis: algorithmic issues |
3 |
| Parikh matrices for powers of words |
2 |
| Generalized contexts for reaction systems: definition and study of dynamic causalities |
2 |
| Fast deterministic parsers for transition networks |
1 |
| Associative composition of components with double-sided interfaces |
1 |
| A core calculus for dynamic delta-oriented programming |
1 |
| Algorithms for monitoring real-time properties |
1 |
| Looking at mean payoff through foggy windows |
1 |
| Petri nets are dioids: a new algebraic foundation for non-deterministic net theory |
1 |
| On the decidability of the existence of polyhedral invariants in transition systems |
1 |
| A generalised theory of Interface Automata, component compatibility and error |
1 |
| Parity game reductions |
1 |
| Reversible sessions with flexible choices |
1 |
| Identity-based signatures in standard model |
1 |
| Red-black trees with constant update time |
0 |
| Weighted iterated linear control |
0 |
| Depletable channels: dynamics, behaviour, and efficiency in network design |
0 |
| A Paxos based algorithm to minimize the overhead of process recovery in consensus |
0 |
| Structural liveness of Petri nets is ExpSpace-hard and decidable |
0 |
| The model checking fingerprints of CTL operators |
0 |
| A new bound for the D0L language equivalence problem |
0 |
| Sparsification and subexponential approximation |
0 |
| Online edge coloring of paths and trees with a fixed number of colors |
0 |
| Conjunctive query containment over trees using schema information |
0 |
| Using contracted solution graphs for solving reconfiguration problems |
0 |
| Distributive laws for monotone specifications |
0 |
| A first step in characterizing three-element codes |
0 |
| Event algebra for transition systems composition application to timed automata |
0 |
| Equivalence checking of Petri net models of programs using static and dynamic cut-points |
0 |
| On path-controlled insertion-deletion systems |
0 |
| Symbolic checking of Fuzzy CTL on Fuzzy Program Graph |
0 |
| Reachability analysis of reversal-bounded automata on series-parallel graphs |
0 |
| Parameterized linear temporal logics meet costs: still not costlier than LTL |
0 |
| Average-energy games |
0 |
| Spanning the spectrum from safety to liveness |
0 |
| Hierarchical information and the synthesis of distributed strategies |
0 |
| TSO-to-TSO linearizability is undecidable |
0 |
| Verification of asynchronous systems with an unspecified component |
0 |
| Negotiation as concurrency primitive |
0 |
| An analysis of the M-X/M/1 queue with multiple working vacations by GI/M/1 type Markov process |
0 |
| Descending chains and narrowing on template abstract domains |
0 |
| Replication, refinement & reachability: complexity in dynamic condition-response graphs |
0 |
| Probabilistic bisimulation for realistic schedulers |
0 |
| On the hardness of analyzing probabilistic programs |
0 |
| Nested antichains for WS1S |
0 |
| Big data interpolation using functional representation |
0 |
| The complexity of counting models of linear-time temporal logic |
0 |
| Factorisation of transition systems |
0 |
