19 search results - page 1 / 4 » A characterization of regular expressions under bisimulation |
60
Voted
JACM
2007
14 years 9 months ago
2007
We solve an open question of Milner [1984]. We define a set of so-called well-behaved finite automata that, modulo bisimulation equivalence, corresponds exactly to the set of reg...
102
click to vote
FORTE
2008
14 years 11 months ago
2008
Abstract. Our concrete objective is to present both ordinary bisimulations and probabilistic bisimulations in a common coalgebraic framework based on multiset bisimulations. For th...
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
Several dynamical systems, such as deterministic automata and labelled transition systems, can be described as coalgebras of so-called Kripke polynomial functors, built up from co...
PODS
2003
ACM
15 years 9 months ago
2003
ACM
In this paper we consider general path constraints for semistructured databases. Our general constraints do not suffer from the limitations of the path constraints previously stud...
FOSSACS
2007
Springer
15 years 3 months ago
2007
Springer
ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions...