681 search results - page 96 / 137 » A Logic for True Concurrency |
TPHOL
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract. FinFuns are total functions that are constant except for a finite set of points, i.e. a generalisation of finite maps. We formalise them in Isabelle/HOL and present how...
FSKD
2007
Springer
15 years 6 months ago
2007
Springer
According to the practical need for uncertain time modeling and analysis in WfMSs, based on possibility theory, the paper firstly introduces fuzzy time and puts forward the concep...
ASPDAC
2006
ACM
15 years 5 months ago
2006
ACM
We propose a methodology for optimal k-way partitioning with replication of directed hypergraphs via Boolean satisfiability. We begin by leveraging the power of existing and emerg...
PDP
2005
IEEE
15 years 5 months ago
2005
IEEE
Boolean Equation Systems (BESs) allow to represent various problems encountered in the area of propositional logic programming and verification of concurrent systems. Several seq...
109
click to vote
CBSE
2005
Springer
15 years 5 months ago
2005
Springer
We consider a class of component-based software models with interaction style of buffered asynchronous message passing between components with ports, represented by UML-RT. After ...